Current Issue : October - December Volume : 2016 Issue Number : 4 Articles : 6 Articles
Image mosaicing sits at the core of many optical mapping applications with mobile robotic\nplatforms. As these platforms have been evolving rapidly and increasing their capabilities, the amount\nof data they are able to collect is increasing drastically. For this reason, the necessity for efficient\nmethods to handle and process such big data has been rising from different scientific fields, where\nthe optical data provides valuable information. One of the challenging steps of image mosaicing is\nfinding the best image-to-map (or mosaic) motion (represented as a planar transformation) for each\nimage while considering the constraints imposed by inter-image motions. This problem is referred\nto as Global Alignment (GA) or Global Registration, which usually requires a non-linear minimization.\nIn this paper, following the aforementioned motivations, we propose a two-step global alignment\nmethod to obtain globally coherent mosaics with less computational cost and time. It firstly tries to\nestimate the scale and rotation parameters and then the translation parameters. Although it requires\na non-linear minimization, Jacobians are simple to compute and do not contain the positions of\ncorrespondences. This allows for saving computational cost and time. It can be also used as a fast way\nto obtain an initial estimate for further usage in the Symmetric Transfer Error Minimization (STEMin)\napproach. We presented experimental and comparative results on different datasets obtained by\nrobotic platforms for mapping purposes....
This paper proposes the combined Laplace-Adomian decomposition method (LADM) for solution\ntwo dimensional linear mixed integral equations of type Volterra-Fredholm with Hilbert kernel.\nComparison of the obtained results with those obtained by the Toeplitz matrix method (TMM)\ndemonstrates that the proposed technique is powerful and simple....
Based on a computational procedure for determining the functional derivative with respect\nto the density of any antisymmetric N-particle wave function for a non-interacting system that leads\nto the density, we devise a test as to whether or not a wave function known to lead to a given density\ncorresponds to a solution of a Schr�¶dinger equation for some potential. We examine explicitly the\ncase of non-interacting systems described by Slater determinants. Numerical examples for the cases\nof a one-dimensional square-well potential with infinite walls and the harmonic oscillator potential\nillustrate the formalism....
We propose an online adaptive local-global POD-DEIM model reduction method for\nflows in heterogeneous porous media. The main idea of the proposed method is to use local\nonline indicators to decide on the global update, which is performed via reduced cost local\nmultiscale basis functions. This unique local-global online combination allows (1) developing local\nindicators that are used for both local and global updates (2) computing global online modes via\nlocal multiscale basis functions. The multiscale basis functions consist of offline and some online\nlocal basis functions. The approach used for constructing a global reduced system is based on\nProper Orthogonal Decomposition (POD) Galerkin projection. The nonlinearities are approximated\nby the Discrete Empirical Interpolation Method (DEIM). The online adaption is performed by\nincorporating new data, which become available at the online stage. Once the criterion for updates\nis satisfied, we adapt the reduced system online by changing the POD subspace and the DEIM\napproximation of the nonlinear functions. The main contribution of the paper is that the criterion\nfor adaption and the construction of the global online modes are based on local error indicators and\nlocal multiscale basis function which can be cheaply computed. Since the adaption is performed\ninfrequently, the new methodology does not add significant computational overhead associated\nwith when and how to adapt the reduced basis. Our approach is particularly useful for situations\nwhere it is desired to solve the reduced system for inputs or controls that result in a solution outside\nthe span of the snapshots generated in the offline stage. Our method also offers an alternative\nof constructing a robust reduced system even if a potential initial poor choice of snapshots is\nused. Applications to single-phase and two-phase flow problems demonstrate the efficiency of\nour method....
In the paper, the authors derive an integral representation, present a double inequality,\nsupply an asymptotic formula, find an inequality, and verify complete monotonicity of a function\ninvolving the gamma function and originating from geometric probability for pairs of hyperplanes\nintersecting with a convex body....
The problem of quantifying the vulnerability of graphs has received much attention\nnowadays, especially in the field of computer or communication networks. In a communication\nnetwork, the vulnerability measures the resistance of the network to disruption of operation after\nthe failure of certain stations or communication links. If we think of a graph as modeling a network,\nthe average lower 2-domination number of a graph is a measure of the graph vulnerability and\nit is defined by Ã?³2avpGq ââ?¬Å? 1\n|VpGq|\nÃ?â?¢\nvPVpGq Ã?³2vpGq, where the lower 2-domination number, denoted\nby Ã?³2vpGq, of the graph G relative to v is the minimum cardinality of 2-domination set in G that\ncontains the vertex v. In this paper, the average lower 2-domination number of wheels and some\nrelated networks namely gear graph, friendship graph, helm graph and sun flower graph are\ncalculated. Then, we offer an algorithm for computing the 2-domination number and the average\nlower 2-domination number of any graph G....
Loading....